DNA Computing Adopting DNA coding Method to solve effective Knapsack Problem
نویسندگان
چکیده
منابع مشابه
Using Parallel Filtering Algorithms to Solve the 0-1 Knapsack Problem on DNA-based Computing
It is shown first by Adleman that deoxyribonucleic acid (DNA) strands could be employed towards calculating solution to an instance of the NP-complete Hamiltonian Path Problem (HPP). Lipton also demonstrated that Adleman’s techniques could be used to solve the satisfiability (SAT) problem. In this paper, it is demonstrated how the DNA operations presented by Adleman and Lipton can be used to de...
متن کاملSolution to the 0-1 Knapsack Problem based on DNA Encoding and Computing Method
DNA computing is a new computational paradigm that executes parallel computation with DNA molecules. Some researches in DNA computing have been presented to solve computational problems such as NPcomplete problems in polynomial increasing time by using its super parallel and high density power. Among them knapsack problem is one of the most common problems which have been studied intensively in...
متن کاملA DNA computing approach to solve Task Assignment problem in Real Time Distributed computing System
Early attention has focused on DNA because its properties are extremely attractive as a basis for a computational system. In this paper, we have proposed a new framework for assigning task in heterogeneous Real time distributed system(RTDS) including the cost of path connecting the nodes. The proposed approach is based upon a DNA replication technique using fixed length coding to select the com...
متن کاملMolecular solution to the 0-1 knapsack problem based on DNA computing
A lot of current research in DNA computing has been directed towards solving hard combinatorial problems. Among them Knapsack problem is one of the most common problems which have been studied intensively in the last decade attracting both theorists and practicians. Fractional Knapsack Problem is easily solvable by greedy strategy, but 0/1 Knapsack Problem is not possible to solve in this metho...
متن کاملA Parallel Biological Optimization Algorithm to Solve the Unbalanced Assignment Problem Based on DNA Molecular Computing
The unbalanced assignment problem (UAP) is to optimally resolve the problem of assigning n jobs to m individuals (m < n), such that minimum cost or maximum profit obtained. It is a vitally important Non-deterministic Polynomial (NP) complete problem in operation management and applied mathematics, having numerous real life applications. In this paper, we present a new parallel DNA algorithm for...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Korean Institute of Intelligent Systems
سال: 2005
ISSN: 1976-9172
DOI: 10.5391/jkiis.2005.15.6.730